Drawing a rooted tree as a rooted y−monotone minimum spanning tree

A Memetic Algorithm and a Solution Archive for the Rooted Delay-Constrained Minimum Spanning Tree Problem

We present a memetic algorithm for a combinatorial optimization problem called rooted delay-constrained minimum spanning tree problem arising for example in centralized broadcasting networks where quality of service constraints are of concern. The memetic algorithm is based on a specialized solution representation and a simple and effective decoding mechanism. Solutions are locally improved by ...

A Kruskal-Based Heuristic for the Rooted Delay-Constrained Minimum Spanning Tree Problem

The rooted delay-constrained minimum spanning tree problem is an NP-hard combinatorial optimization problem arising for example in the design of centralized broadcasting networks where quality of service constraints are of concern. We present a construction heuristic based on Kruskal’s algorithm for finding a minimum cost spanning tree which eliminates some drawbacks of existing heuristic metho...

A Constraint-Based Local Search for Edge Disjoint Rooted Distance-Constrained Minimum Spanning Tree Problem

Many network design problems arising in areas as diverse as VLSI circuit design, QoS routing, traffic engineering, and computational sustainability require clients to be connected to a facility under path-length constraints and budget limits. These problems can be modelled as Rooted Distance-Constrained Minimum Spanning-Tree Problem (RDCMST), which is NP-hard. An inherent feature of these netwo...

A Multilevel Heuristic for the Rooted Delay-Constrained Minimum Spanning Tree Problem

The rooted delay-constrained minimum spanning tree (RDCMST) problem is an NP-hard [3] combinatorial optimization problem. The objective is to find a minimum cost spanning tree in a given graph with cost and delay values assigned to each edge. Additionally, a delay-bound is given limiting the maximum delay allowed for each path between a specified root vertex and any other vertex in the graph. T...

Using a Solution Archive to Enhance Metaheuristics for the Rooted Delay-Constrained Minimum Spanning Tree Problem